Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
نویسندگان
چکیده
In this paper we give, for all constants k, l, explicit algorithms that, given a graph Ž . G s V, E with a tree-decomposition of G with treewidth at most l, decide Ž . whether the treewidth or pathwidth of G is at most k, and, if so, find a Ž . tree-decomposition or path-decomposition of G of width at most k, and that use Ž < <. O V time. In contrast with previous solutions, our algorithms do not rely on non-constructive reasoning and are single exponential in k and l. This result can w be combined with a result of B. Reed in ‘‘Proceedings of the 24th Annual x Symposium on Theory of Computing,’’ pp. 221]228, 1992 , yielding explicit Ž . O n log n algorithms for the problem, given a graph G, to determine whether the Ž . Ž . treewidth or pathwidth of G is at most k, and, if so, to find a treeor pathŽ . w decomposition of width at most k k constant . Also, H. L. Bodlaender in ‘‘Proceedings of the 25th Annual Symposium on Theory of Computing,’’ pp. x 226]234, 1993 has used the result of this paper to obtain linear time algorithms for these problems. We also show that for all constants k, there exists a polynomial Ž . time algorithm that, when given a graph G s V, E with treewidth F k, computes the pathwidth of G and a path-decomposition of G of minimum width. Q 1996
منابع مشابه
Efficient and Constructive Algorithms
In this paper we give, for all constants k, l, explicit algorithms, that given a graph G = (V, E) with a tree-decomposition of G with treewidth at most l, decide whether the treewidth (or pathwidth) of G is at most k, and if so, find a tree-decomposition or (path-decomposition) of G of width at most k, and that use O(IVD time. In contrast with previous solutions, our algorithms do not rely on n...
متن کاملApproximation algorithms for digraph width parameters
Treewidth of an undirected graph measures how close the graph is to being a tree. Several problems that are NP-hard on general graphs are solvable in polynomial time on graphs with bounded treewidth. Motivated by the success of treewidth, several directed analogues of treewidth have been introduced to measure the similarity of a directed graph to a directed acyclic graph (DAG). Directed treewid...
متن کاملApproximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using an algorithm of Leighton et al. that nds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum elimination tree height, are no more than O(logn) (minimum front size and treewidth) and O(log 2 ...
متن کاملSome Reduction Procedure for Computing Pathwidth of Undirected Graphs
Computing an invariant of a graph such as treewidth and pathwidth is one of the fundamental problems in graph algorithms. In general, determining the pathwidth of a graph is NP-hard. In this paper, we propose several reduction methods for decreasing the instance size without changing the pathwidth, and implemented the methods together with an exact algorithm for computing pathwidth of graphs. O...
متن کاملComputing Bounded Path Decompositions in Logspace
The complexity of Graph Isomorphism (GI) is a long-standing open problem. GI is not known to be solvable in polynomial time and is unlikely to be NP-complete [BHZ87, Sch88]. Polynomial-time algorithms are known for GI of several special classes of graphs. One such interesting class is graphs excluding a fixed minor. Any family of graphs that is closed under taking minors falls into this class. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 21 شماره
صفحات -
تاریخ انتشار 1996